R-Trees and Symmetric Differences of Sets
نویسندگان
چکیده
منابع مشابه
The symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملThe (R,S)-symmetric and (R,S)-skew symmetric solutions of the pair of matrix equations A1XB1 = C1 and A2XB2 = C2
Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...
متن کاملCharacterization and Properties of (R, S)-Symmetric, (R, S)-Skew Symmetric, and (R, S)-Conjugate Matrices
SIAM J. Matrix Anal Appl. 26 (2005) 748–757 Abstract. Let R ∈ C and S ∈ C be nontrivial involutions; i.e., R = R 6= ±Im and S = S 6= ±In. We say that A ∈ C is (R,S)-symmetric ((R,S)-skew symmetric) if RAS = A (RAS = −A). We give an explicit representation of an arbitrary (R,S)-symmetric matrix A in terms of matrices P andQ associatedwith R and U and V associatedwith S. If R = R, then the least ...
متن کاملFinite Sets and Symmetric Simplicial Sets
The category of finite cardinals (or, equivalently, of finite sets) is the symmetric analogue of the category of finite ordinals, and the ground category of a relevant category of presheaves, the augmented symmetric simplicial sets. We prove here that this ground category has characterisations similar to the classical ones for the category of finite ordinals, by the existence of a universal sym...
متن کاملFractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring problem in trees. We consider the class of locally-symmetric sets of paths on binary trees and prove that any such set of paths has a fractional coloring of cost at most 1.367L, where L denotes the load of the set of paths. Using this result, we obtain a randomized algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1997
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0134